A robust and efficient mechanism for constructing multicast acknowledgement trees

نویسندگان

  • Kurt Rothermel
  • Christian Maihöfer
چکیده

A great variety of todays networked applications require a reliable multicast service. A number of the proposed reliable multicast protocols use a positive acknowledgment scheme, which returns ACKs to the sender to confirm correct delivery. To avoid the well-known implosion problem in the case of large receiver groups, often a tree-based approach is used, i.e., receivers are organized in a tree and ACK messages are passed along the edges of this so-called ACK tree. For building up this tree variations of the Expanding Ring Search (ERS) scheme have been proposed. However, our simulations show that ERS scales poorly. In this paper, we propose an alternative scheme for building up ACK trees. This scheme is based on a so-called token repository service, where a token represents the right to connect to a certain node in the corresponding ACK tree. Nodes that want to join a group just request a token for this group from the (distributed) token repository service. Our simulations show that our scheme causes a much lower message overhead than ERS. Moreover, the quality of the resulting ACK trees in terms of delay and reliability is in many cases higher if generated with our scheme.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Robust and Efficient Mechanism for Constructing Multicast Acknowledgment Trees

A great variety of todays networked applications require a reliable multicast service. A number of the proposed reliable multicast protocols use a positive acknowledgment scheme, which returns ACKs to the sender to confirm correct delivery. To avoid the well-known implosion problem in the case of large receiver groups, often a tree-based approach is used, i.e., receivers are organized in a tree...

متن کامل

Constructing Height-Balanced Multicast Acknowledgment Trees with the Token Repository Service

Many reliable multicast protocols use socalled ACK-trees to avoid the well-known acknowledgment implosion problem in case of large multicast groups. For constructing ACK trees, usually expanding ring search techniques are applied. Our simulation results show that those techniques have scalability problems itself. In this paper, we propose a novel approach for building ACK trees, the token repos...

متن کامل

Multicast computer network routing using genetic algorithm and ant colony

Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...

متن کامل

A Combined Group/Tree Approach for Many-to-Many Reliable Multicast

In this paper we present the design, implementation, and performance analysis of Group-Aided Multicast (GAM), a scalable many-tomany reliable multicast transport protocol. GAM achieves high quality ACK trees while keeping the tree maintenance overhead reasonably low in the presence of dynamic group membership and route changes. It is supported by a group configuration mechanism organizing the m...

متن کامل

A Heuristic Genetic Algorithm for Distributed Multicast Routing

Multicast (MC) routing algorithms capable of satisfying the quality of services(QoS) requirements of real-time applications will be essential for future high-speed networks. Genetic Algorithms (GA) are stochastic search optimisation methods used in combinatorial optimisation and parameter tuning applications. In this paper, a shared-tree routing protocol based on distributed Genetic Algorithms(...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999